How is a chordal graph like a supersolvable binary matroid?

Let G be a finite simple graph. From the pioneering work of R. P. Stanley it is known that the cycle matroid of G is supersolvable if and only if G is chordal. The chordal binary matroids are not in general supersolvable. Nevertheless we prove that every supersolvable binary matroid determines canonically a chordal graph.